Graph Minors .XII. Distance on a Surface
نویسندگان
چکیده
منابع مشابه
Graph Minors
For a given graph G and integers b, f ≥ 0, let S be a subset of vertices of G of size b + 1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every graph on n vertices contains at most n/ b+f b such vertex subsets. This result from extremal combinatorics appears to be very useful in the design of several e...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملTreewidth and graph minors
We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph problem has a polynomial time algorithm (though the algorithms that come out of the theory are often not practical). We shall review a small part of this theory, and illustrate how dynamic programming can be used to solve some NP-hard problems on restricted cla...
متن کاملGraph minors and linkages
Bollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense graph minor. In this paper we investigate the ties between small graph minors and linkages. In particular, we show that a 6-connected graph with a K− 9 minor is 3-linked. Further, we show that a 7-connected graph with a K− 9 minor is (2, 5)-linked. Finally, we show that a graph of order n and size...
متن کاملOn graph contractions and induced minors
The Induced Minor Containment problem takes as input two graphs G and H, and asks whether G has H as an induced minor. We show that this problem is fixed parameter tractable in |VH | if G belongs to any nontrivial minor-closed graph class and H is a planar graph. For a fixed graph H, the H-Contractibility problem is to decide whether a graph can be contracted to H. The computational complexity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1995
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1034